random mapping


random mapping
случайное отображение

English-Russian cryptological dictionary . 2014.

Смотреть что такое "random mapping" в других словарях:

  • Random self-reducibility — (RSR): A good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability to solve all instances of a problem by solving a large fraction of the instances.DefinitionIf a function f evaluating any instance x can… …   Wikipedia

  • Random variable — A random variable is a rigorously defined mathematical entity used mainly to describe chance and probability in a mathematical way. The structure of random variables was developed and formalized to simplify the analysis of games of chance,… …   Wikipedia

  • Random oracle — In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every query with a (truly) random response chosen uniformly from its output domain, except that for any specific query, it responds the same way every time… …   Wikipedia

  • Comparison of programming languages (mapping) — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations …   Wikipedia

  • Convergence of random variables — In probability theory, there exist several different notions of convergence of random variables. The convergence of sequences of random variables to some limit random variable is an important concept in probability theory, and its applications to …   Wikipedia

  • Simultaneous localization and mapping — A robot built by Technische Universität Darmstadt maps a maze using a LIDAR …   Wikipedia

  • Continuous mapping theorem — In probability theory, the continuous mapping theorem states that continuous functions are limit preserving even if their arguments are sequences of random variables. A continuous function, in Heine’s definition, is such a function that maps… …   Wikipedia

  • Happy mapping — was [http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=318413 tools=bot first proposed] by Paul H. Dear and Peter R. Cook in 1989, it is a method used in molecular biology to study the linkage between two or more DNA sequences. According… …   Wikipedia

  • Occupancy grid mapping — refers to a family of computer algorithms in probabilistic robotics for mobile robots which address the problem of generating maps from noisy and uncertain sensor measurement data, with the assumption that the robot pose is known. The basic idea… …   Wikipedia

  • Markov random field — A Markov random field, Markov network or undirected graphical model is a set of variables having a Markov property described by an undirected graph. A Markov random field is similar to a Bayesian network in its representation of dependencies. It… …   Wikipedia

  • Photon mapping — In computer graphics, photon mapping is a two pass global illumination algorithm developed by Henrik Wann Jensen that solves the rendering equation. Rays from the light source and rays from the camera are traced independently until some… …   Wikipedia

Книги

Другие книги по запросу «random mapping» >>


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.